Batch arrival queue with N-policy and at most J vacations
نویسندگان
چکیده
منابع مشابه
Batch arrival queue with N-policy and single vacation
We consider an MXI ell queueing system with N-policy and single vacation. As soon as the system becomes empty, the server leaves the system for a vacation of random length 11: When he returns from the vacation, if the system size is greater than or equal to a pretermined value N(threshold), he begins to serve the customers. If not, the server waits in the system until the system size reaches or...
متن کاملA Heterogeneous Arrival Queue under N Policy with Server Breakdowns and Multiple Vacations
We consider the problem of investment and consumption with a hidden Markov model and a regime switching structure. The Bayesian approach is followed to integrate econometric consideration and to make inference of the hidden Markov model. The optimal investment strategy is characterized by the method of stochastic dynamic programming and simulation results are given.
متن کاملA Heterogeneous Arrival Queue under N Policy with Server Breakdowns and Multiple Vacations
Abstract: The cumulative damage of highly reliable products that subject to multiple loading stresses is investigated under Wiener process. Optimal strategies on the constant-stress accelerated degradation test plan are established to reach a compromised decision between the experiment budget and the estimation precision on the reliability inference. An algorithm is provided to search an optima...
متن کاملThe Optimal Control in Batch Arrival Queue with Server Vacations, Startup and Breakdowns
This paper studies the N policy M/G/1 queue with server vacations; startup and breakdowns, where arrivals form a compound Poisson process and service times are generally distributed. The server is turned off and takes a vacation whenever the system is empty. If the number of customers waiting in the system at the instant of a vacation completion is less than N, the server will take another vaca...
متن کاملA Batch Arrival Retrial Queue with Two Phases of Service, Feedback and K Optional Vacations
We consider a batch arrival queueing system with two phases of service, feedback and K optional vacations under a classical retrial policy. At the arrival epoch, if the server is busy the whole batch joins the orbit. Whereas if the server is free, then one of the arriving customer starts its service immediately and the rest joins the orbit. For each customer, the server provides two phases of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2010
ISSN: 0307-904X
DOI: 10.1016/j.apm.2009.06.003